منابع مشابه
Finding an Approximate Maximum
Suppose that there are n elements from a totally ordered domain. The objective is to find, in a minimum possible number of rounds, an element that belongs to the biggest n/2, where in each round one is allowed to ask n binary comparisons. It is shown that log* n +19(1) rounds are both necessary and sufficient in the best algorithm for this problem.
متن کاملApproximate Algorithm for Finding maximum upward emeddable sub - digraph of an acyclic
Graphs appear as simplified representations of a diversity of real-world structures. Naturally there is a question of an intrinsic graph metric, often presumed to be the “shortestpath” metric. Other plausible possibilities for intrinsic graph metrics are formulated in terms of the (combinatorial) Laplacian matrix of the graph, as well as in terms of other combinatoric, probabilistic, and physic...
متن کاملApproximate Profile Maximum Likelihood
We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML has appealing theoretical properties, but is difficult to compute exactly. Inspired by observations gleaned from exactly solvable cases, we look for an appro...
متن کاملApproximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this subgraph closely approximates the maximum weight branching in the original graph. Specifically, it is within a factor of k k+1 . Our interest in finding branchings in this subgraph is motivated by a data compression appl...
متن کاملFinding All Approximate Gapped Palindromes
We study the problem of finding all maximal approximate gapped palindromes in a string. More specifically, given a string S of length n, a parameter q ≥ 0 and a threshold k > 0, the problem is to identify all substrings in S of the form uvw such that (1) the Levenshtein distance between u and w is at most k, where w is the reverse of w and (2) v is a string of length q. The best previous work r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1989
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0218017